Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
نویسندگان
چکیده
A convex body K in R has around it a unique circumscribed ellipsoid CE(K) with minimum volume, and within it a unique inscribed ellipsoid IE(K) with maximum volume. The modern theory of these ellipsoids is pioneered by Fritz John in his seminal 1948 paper. This paper has two, related goals. First, we investigate the symmetry properties of a convex body by studying its (affine) automorphism group Aut(K), and relate this group to the automorphism groups of its ellipsoids. We show that if Aut(K) is large enough, then the complexity of determining the ellipsoids CE(K) and IE(K) is greatly reduced, and in some cases, the ellipsoids can be determined explicitly. We then use this technique to compute the extremal ellipsoids associated with some classes of convex bodies that have important applications in convex optimization, namely when the convex body K is the part of a given ellipsoid between two parallel hyperplanes, and when K is a truncated second-order cone or an ellipsoidal cylinder.
منابع مشابه
The extremal volume ellipsoids of convex bodies, their symmetry properties, and their determination in some special cases
A convex body K in R has associated with it a unique circumscribed ellipsoid CE(K) with minimum volume, and a unique inscribed ellipsoid IE(K) with maximum volume. We first give a unified, modern exposition of the basic theory of these extremal ellipsoids using the semi–infinite programming approach pioneered by Fritz John in his seminal 1948 paper. We then investigate the automorphism groups o...
متن کاملFunctionally closed sets and functionally convex sets in real Banach spaces
Let $X$ be a real normed space, then $C(subseteq X)$ is functionally convex (briefly, $F$-convex), if $T(C)subseteq Bbb R $ is convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$ is functionally closed (briefly, $F$-closed), if $T(K)subseteq Bbb R $ is closed for all bounded linear transformations $Tin B(X,R)$. We improve the Krein-Milman theorem ...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملConvex structures via convex $L$-subgroups of an $L$-ordered group
In this paper, we first characterize the convex $L$-subgroup of an $L$-ordered group by means of fourkinds of cut sets of an $L$-subset. Then we consider the homomorphic preimages and the product of convex $L$-subgroups.After that, we introduce an $L$-convex structure constructed by convex $L$-subgroups.Furthermore, the notion of the degree to which an $L$-subset of an $L$-ord...
متن کاملWeights in block iterative methods
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Optimization Methods and Software
دوره 27 شماره
صفحات -
تاریخ انتشار 2012